#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i(a);i<=(b);++i)
#define req(i,a,b) for(int i(a);i>=(b);--i)
#define sort stable_sort
using namespace std;
char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?EOF:*p1++)
template<typename TP> inline TP read(TP &num)
{
	TP x=0;
	int f=0;
	char ch=getchar();
	while(ch<48||ch>57) f|=ch=='-',ch=getchar();
	while(48<=ch&&ch<=57) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return num=f?-x:x;
}
template<typename ...Args> inline void read(Args &...args)
{
	(read(args),...);
}
template<typename TP> inline void write(TP x)
{
	(x<0)?(putchar('-'),x=-x):0;
	(x>9)?(write(x/10),0):0;
	putchar((x%10)^48);
}
template<typename TP> inline void writeln(TP x)
{
	write<TP>(x);
	puts("");
}
int n,k,a[100001],ans;
signed main()
{
	freopen("reporter.in","r",stdin);
	freopen("reporter.out","w",stdout);
	read(n,k);rep(i,1,n)read(a[i]);
	rep(i,1,n)
	{
		map<int,int>cnt,cntt;
		rep(j,i,n)
		{
			if(cnt[a[j]])--cntt[cnt[a[j]]];
			++cnt[a[j]],++cntt[cnt[a[j]]];
			int ok=1;rep(i,1,k)ok&=!!(cntt[i]);ans+=ok;
		}
	}
	cout<<ans;
}
